Data-Parallel Computing

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reoptimizing Data Parallel Computing

Performant execution of data-parallel jobs needs good execution plans. Certain properties of the code, the data, and the interaction between them are crucial to generate these plans. Yet, these properties are dif�cult to estimate due to the highly distributed nature of these frameworks, the freedom that allows users to specify arbitrary code as operations on the data, and since jobs in modern c...

متن کامل

Data-Parallel Computing Meets STRIPS

The increased demand for distributed computations on big data has led to solutions such as SCOPE, DryadLINQ, Pig, and Hive, which allow the user to specify queries in an SQL-like language, enriched with sets of user-defined operators. The lack of exact semantics for user-defined operators interferes with the query optimization process, thus putting the burden of suggesting, at least partial, qu...

متن کامل

Parallel computing for biological data

English In the 1990s a number of technological innovations appeared that revolutionized biology, and ’Bioinformatics’ became a new scientific discipline. Microarrays can measure the abundance of tens of thousands of mRNA species, data on the complete genomic sequences of many different organisms are available, and other technologies make it possible to study various processes at the molecular l...

متن کامل

Optimizing Data Partitioning for Data-Parallel Computing

Performance of data-parallel computing (e.g., MapReduce, DryadLINQ) heavily depends on its data partitions. Solutions implemented by the current state of the art systems are far from optimal. Techniques proposed by the database community to find optimal data partitions are not directly applicable when complex user-defined functions and data models are involved. We outline our solution, which dr...

متن کامل

Vector Models for Data-Parallel Computing

ion,level of, 24access-fixed code, 150, 217access-restricted code, 149, 217algorithm,biconnectivity, 114binary search, 94closest pair, 98halving merge, 54k-D tree, 96line-drawing, 50line-of-sight, 40, 105linear-systems, 118matrix-vector multiply, 117maximal-independent-set, 114maximum-flow, 114merge-hull, 103minimum-spanning-tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queue

سال: 2008

ISSN: 1542-7730,1542-7749

DOI: 10.1145/1365490.1365499